Optimization of Palletization in a Production Job Shop
نویسندگان
چکیده
We describe the application of simulation and statistical analysis to the problem of optimization of palletization in a production job shop. These analyses enabled management responsible for the production of this job shop to optimize the number of pallets, the size (carrying capacity) of the pallets, the associated workin-process levels, and policy regarding level of safetystock kept on hand at various places in the job shop. Additionally, management also confirmed throughput levels for various values chosen for these quantities.
منابع مشابه
A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملDetermining Maintenance Opportunity Window (MOW) in Job-Shop Systems by Considering Manpower of Maintenance
Nowadays, production systems seek to integrate production and maintenance activities. An effective maintenance plan can improve maintenance stability and system performance. Machines that stop for repairing operation impose a high cost on the system. On the other hand, there are always some intangible situations during a production process in which repairing activities can be carried out. If th...
متن کاملImproving for Drum_Buffer_Rope material flow management with attention to second bottlenecks and free goods in a job shop environment
Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کامل